Petri Nets and Regular Processes
نویسندگان
چکیده
منابع مشابه
Petri Nets and Regular Processes
We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent? (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of trace and bisimulation equivalences, in both their strong and weak versions. (In the weak version a special action—likened to an "-move in autom...
متن کاملRegular stochastic Petri nets
An extension of regular nets, a class of coloredd nets, to a stochastic model is proposed. We show that the symmetries in this class of nets make it pos sible to developp a performance evaluation by constructingg only a graph of symbolic markings, which ver tices are classes of states, insteadd of the whole reachability graph. Usingg algebraic techniques, we prove that all the states in a class...
متن کاملProcesses in Petri Nets
Sequential and concurrent compositions of processes in Petri nets are introduced. A process is formalized as a set of (possible), so called, firing sequences. In the definition of the sequential composition the standard concatenation is used
متن کاملProcesses of timed Petri nets
Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without specifying when particular situations appear (free processes), or together with the respective appearan...
متن کاملCombining Petri Nets and PA-Processes
Petri nets and PA-processes are incomparable models of inn-nite state concurrent systems. We deene a new model PAN (= PA + PN) that subsumes both of them and is thus strictly more expressive than Petri nets. It extends Petri nets with the possibility to call subroutines. We show that the reachability problem is still decidable for PAN. It is even decidable, if there is a reachable state that sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1999.1643